Mechanism Design with Partially Verifiable Information
نویسندگان
چکیده
منابع مشابه
Communication Equilibria with Partially Verifiable Types∗
This paper studies the set of equilibria that can be achieved by adding general communication systems to Bayesian games in which some information can be certified or, equivalently, in which players’ types are partially verifiable. Given the information that players are able to certify, we characterize outcomeequivalent canonical equilibria for which generalized versions of the revelation princi...
متن کاملMechanism design with partially - specified participation games Laurent Lamy
This paper considers the implementation of an economic outcome under complete information when the strategic and informational details of the participation game are partially-specified. This means that full participation is required to be a subgame-perfect equilibrium for a large variety of extensive modifications of the simultaneous-move participation game in the same vein as Kalai [Large Robu...
متن کاملInformation in Mechanism Design
We survey the recent literature on the role of information in mechanism design. First, we discuss an emerging literature on the role of endogenous payoff and strategic information for the design and the efficiency of the mechanism. We specifically consider information management in the form of acquisition of new information or disclosure of existing information. Second, we argue that in the pre...
متن کاملTwo - person bargaining with verifiable information
We study Myerson’s incomplete information bargaining solution under the assumption of verifiable types. For the case of an informed principal, in which one individual has all the bargaining power, we provide exact characterizations both from the non cooperative and from the cooperative perspective. We then show that the axiomatic characterization can be extended to the case in which both indivi...
متن کاملMinimum Information Disclosure with Efficiently Verifiable Credentials
Public-key based certificates provide a standard way to prove one's identity, as certified by some certificate authority (CA). However, standard certificates provide a binary identification: either the whole identity of the subject is known, or nothing is known. We propose using a Merkle hash tree structure, whereby it is possible for a single certificate to certify many separate claims or attr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2016
ISSN: 1556-5068
DOI: 10.2139/ssrn.2784207